A Fast Recursive Algorithm for Constructing Matrices with Prescribed Eigenvalues and Singular Values
نویسنده
چکیده
The Weyl Horn theorem characterizes a relationship between the eigenvalues and the singular values of an arbitrary matrix Based on that charac terization a fast recursive algorithm is developed to construct numerically a matrix with prescribed eigenvalues and singular values Beside being theoretically interest ing the technique could be employed to create test matrices with desired spectral features Numerical experiment shows this algorithm is quite e cient and robust
منابع مشابه
On Constructing Matrices with Prescribed Singular Values and Diagonal Elements
Similar to the well known Schur Horn theorem that characterizes the relationship between the diagonal entries and the eigenvalues of a Hermitian matrix the Sing Thompson theorem characterizes the relationship between the diagonal en tries and the singular values of an arbitrary matrix It is noted in this paper that based on the induction principle such a matrix can be constructed numerically by...
متن کاملConstruction of matrices with prescribed singular values and eigenvalues
Two issues concerning the construction of square matrices with prescribed singular values and eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values and m(≤ n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating ...
متن کاملA. Horn's result on matrices with prescribed singular values and eigenvalues
We give a new proof of a classical result of A. Horn on the existence of a matrix with prescribed singular values and eigenvalues.
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملOn the mean density of complex eigenvalues for an ensemble of random matrices with prescribed singular values
Given any fixed N×N positive semi-definite diagonal matrix G ≥ 0 we derive the explicit formula for the density of complex eigenvalues for random matrices A of the form A = U √ G where the random unitary matrices U are distributed on the group U(N) according to the Haar measure.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 37 شماره
صفحات -
تاریخ انتشار 2000